________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:57:40
Input Data from:  dataset164.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,156166666666667
Average f[i]   :4775
Average g[i,j] :2016,66666666667
Total demand   :16670
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	3360	1	-1	7	6500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3360


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	4460	1	-1	3	10500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 4460


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 84
> Selected Move:	5700	1	-1	5	16500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5700


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 94
> Selected Move:	7270	1	-1	9	23000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 7270


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 97
> Selected Move:	7810	1	-1	14	27000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 61
> Selected Move:	8810	3	9	18	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 68
> Selected Move:	9580	3	7	4	23000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0    >new incumb.: 9580


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 95
> Selected Move:	9792	3	3	11	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 107
> Selected Move:	9580	3	11	17	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 101
> Selected Move:	9210	3	5	13	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 110
> Selected Move:	9530	3	17	11	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 112
> Selected Move:	9520	3	4	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 109
> Selected Move:	9935	3	13	19	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 72
> Selected Move:	9908	3	19	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,47

## ITERATION 14 #######################


> Neighbours evaluated; 68
> Selected Move:	9740	3	6	15	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  1  0    >new incumb.: 9740


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,465

## ITERATION 15 #######################


> Neighbours evaluated; 59
> Selected Move:	9951	3	1	6	25600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  0  1  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 16 #######################


> Neighbours evaluated; 27
> Selected Move:	10230	4	6	11	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  3  0  0  1  1  1  0  1  0    >new incumb.: 10230


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 17 #######################


> Neighbours evaluated; 49
> Selected Move:	10230	3	6	19	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,45

## ITERATION 18 #######################


> Neighbours evaluated; 35
> Selected Move:	10005	3	18	13	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  3  0  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 19 #######################


> Neighbours evaluated; 70
> Selected Move:	10008	3	19	6	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 20 #######################


> Neighbours evaluated; 97
> Selected Move:	9780	3	13	5	26000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 21 #######################


> Neighbours evaluated; 94
> Selected Move:	9775	3	6	19	26000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 22 #######################


> Neighbours evaluated; 80
> Selected Move:	9620	3	19	18	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 23 #######################


> Neighbours evaluated; 82
> Selected Move:	9860	3	16	4	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 24 #######################


> Neighbours evaluated; 80
> Selected Move:	9580	3	5	6	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 25 #######################


> Neighbours evaluated; 58
> Selected Move:	9690	3	14	16	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 26 #######################


> Neighbours evaluated; 64
> Selected Move:	9620	3	6	19	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 27 #######################


> Neighbours evaluated; 58
> Selected Move:	9530	3	11	14	24700


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  3  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,46

## ITERATION 28 #######################


> Neighbours evaluated; 42
> Selected Move:	9580	3	19	6	24700


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,455

## ITERATION 29 #######################


> Neighbours evaluated; 47
> Selected Move:	9580	4	14	6	23100


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,45

## ITERATION 30 #######################


> Neighbours evaluated; 59
> Selected Move:	9580	4	6	16	24900


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,445

## ITERATION 31 #######################


> Neighbours evaluated; 46
> Selected Move:	9580	4	16	18	24300


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,44

## ITERATION 32 #######################


> Neighbours evaluated; 50
> Selected Move:	9580	3	18	13	24100


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 33 #######################


> Neighbours evaluated; 91
> Selected Move:	9580	4	13	6	23600


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 34 #######################


> Neighbours evaluated; 90
> Selected Move:	9757	3	4	11	26100


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  0  1  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 35 #######################


> Neighbours evaluated; 89
> Selected Move:	9763	3	6	19	26100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 36 #######################


> Neighbours evaluated; 61
> Selected Move:	9978	3	13	18	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,415

## ITERATION 37 #######################


> Neighbours evaluated; 43
> Selected Move:	9750	3	19	9	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  1  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 38 #######################


> Neighbours evaluated; 73
> Selected Move:	9545	4	9	11	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 39 #######################


> Neighbours evaluated; 68
> Selected Move:	9520	3	9	13	24500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  3  0  1  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 40 #######################


> Neighbours evaluated; 98
> Selected Move:	9490	3	16	4	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 41 #######################


> Neighbours evaluated; 91
> Selected Move:	9530	3	13	19	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 42 #######################


> Neighbours evaluated; 47
> Selected Move:	9660	1	-1	16	29000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,395

## ITERATION 43 #######################


> Neighbours evaluated; 31
> Selected Move:	9640	3	19	6	29000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 44 #######################


> Neighbours evaluated; 42
> Selected Move:	9570	4	0	6	24500


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  0  0  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,405

## ITERATION 45 #######################


> Neighbours evaluated; 59
> Selected Move:	9678	3	4	12	25500


> New Y[]: 
	
	 0  0  0  0  0  0  2  0  0  0  0  3  1  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,41

## ITERATION 46 #######################


> Neighbours evaluated; 44
> Selected Move:	9711	3	6	19	25900


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  3  1  0  1  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,415

## ITERATION 47 #######################


> Neighbours evaluated; 26
> Selected Move:	9847	3	12	2	25900


> New Y[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  3  0  0  1  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,42

## ITERATION 48 #######################


> Neighbours evaluated; 30
> Selected Move:	9884	4	11	19	25800


> New Y[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  2  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,425

## ITERATION 49 #######################


> Neighbours evaluated; 39
> Selected Move:	9740	3	2	12	25800


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  2  1  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,43

## ITERATION 50 #######################


> Neighbours evaluated; 34
> Selected Move:	9620	3	12	4	24800


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  2  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 51 #######################


> Neighbours evaluated; 54
> Selected Move:	9620	4	11	19	24900


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  3  0  0  1  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 52 #######################


> Neighbours evaluated; 61
> Selected Move:	9484	3	18	13	25400


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,445

## ITERATION 53 #######################


> Neighbours evaluated; 69
> Selected Move:	9550	3	19	6	25000


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  0  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0 
 > pw :0,45

## ITERATION 54 #######################


> Neighbours evaluated; 76
> Selected Move:	9450	3	6	0	23500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 55 #######################


> Neighbours evaluated; 89
> Selected Move:	9530	3	11	19	23600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 56 #######################


> Neighbours evaluated; 81
> Selected Move:	9530	4	19	13	24100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 57 #######################


> Neighbours evaluated; 73
> Selected Move:	9530	3	13	18	24300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,45

## ITERATION 58 #######################


> Neighbours evaluated; 43
> Selected Move:	9530	4	18	16	24900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,445

## ITERATION 59 #######################


> Neighbours evaluated; 37
> Selected Move:	9530	4	16	19	23100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,44

## ITERATION 60 #######################


> Neighbours evaluated; 55
> Selected Move:	9520	3	0	2	25000


> New Y[]: 
	
	 0  0  2  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,435

## ITERATION 61 #######################


> Neighbours evaluated; 38
> Selected Move:	9490	3	19	6	25000


> New Y[]: 
	
	 0  0  2  0  1  0  3  0  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,43

## ITERATION 62 #######################


> Neighbours evaluated; 35
> Selected Move:	9570	3	2	11	24800


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  0  0  0  2  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,425

## ITERATION 63 #######################


> Neighbours evaluated; 59
> Selected Move:	9540	3	4	12	25800


> New Y[]: 
	
	 0  0  0  0  0  0  3  0  0  0  0  2  1  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,42

## ITERATION 64 #######################


> Neighbours evaluated; 43
> Selected Move:	9590	3	6	1	23700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  2  1  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,415

## ITERATION 65 #######################


> Neighbours evaluated; 60
> Selected Move:	9730	3	12	2	23700


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  2  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,41

## ITERATION 66 #######################


> Neighbours evaluated; 66
> Selected Move:	9873	3	15	19	25700


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  2  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,405

## ITERATION 67 #######################


> Neighbours evaluated; 61
> Selected Move:	9737	3	2	12	25700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  2  1  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,4

## ITERATION 68 #######################


> Neighbours evaluated; 65
> Selected Move:	9600	3	19	6	25700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  0  2  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 69 #######################


> Neighbours evaluated; 68
> Selected Move:	9485	4	11	6	26000


> New Y[]: 
	
	 0  3  0  0  0  0  2  0  0  0  0  1  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 70 #######################


> Neighbours evaluated; 71
> Selected Move:	9460	3	6	19	26400


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,405

## ITERATION 71 #######################


> Neighbours evaluated; 55
> Selected Move:	9593	3	12	2	26400


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,41

## ITERATION 72 #######################


> Neighbours evaluated; 69
> Selected Move:	9350	3	11	4	23900


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 73 #######################


> Neighbours evaluated; 72
> Selected Move:	9400	3	18	13	24400


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 74 #######################


> Neighbours evaluated; 97
> Selected Move:	9370	3	19	6	24000


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 75 #######################


> Neighbours evaluated; 85
> Selected Move:	9370	3	13	18	23500


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,43

## ITERATION 76 #######################


> Neighbours evaluated; 55
> Selected Move:	9370	4	6	2	24900


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,435

## ITERATION 77 #######################


> Neighbours evaluated; 46
> Selected Move:	9380	3	2	0	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,43

## ITERATION 78 #######################


> Neighbours evaluated; 60
> Selected Move:	9450	3	1	11	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 79 #######################


> Neighbours evaluated; 64
> Selected Move:	9450	3	6	15	23000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,42

## ITERATION 80 #######################


> Neighbours evaluated; 53
> Selected Move:	9450	4	11	18	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,415

## ITERATION 81 #######################


> Neighbours evaluated; 52
> Selected Move:	9483	3	4	6	26800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 82 #######################


> Neighbours evaluated; 47
> Selected Move:	9574	3	18	13	26600


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  1  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 83 #######################


> Neighbours evaluated; 95
> Selected Move:	9582	3	6	19	26600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  0  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 84 #######################


> Neighbours evaluated; 78
> Selected Move:	9510	3	13	18	26800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,395

## ITERATION 85 #######################


> Neighbours evaluated; 36
> Selected Move:	9480	3	18	5	26900


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  1  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 86 #######################


> Neighbours evaluated; 69
> Selected Move:	9590	4	5	19	26600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  1  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 87 #######################


> Neighbours evaluated; 73
> Selected Move:	9740	3	19	1	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 88 #######################


> Neighbours evaluated; 110
> Selected Move:	9740	3	5	13	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 89 #######################


> Neighbours evaluated; 112
> Selected Move:	9755	3	15	19	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 90 #######################


> Neighbours evaluated; 106
> Selected Move:	9720	3	19	6	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 91 #######################


> Neighbours evaluated; 96
> Selected Move:	9503	3	13	5	26500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 92 #######################


> Neighbours evaluated; 98
> Selected Move:	9525	3	6	19	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 93 #######################


> Neighbours evaluated; 109
> Selected Move:	9403	3	19	18	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 94 #######################


> Neighbours evaluated; 106
> Selected Move:	9660	3	5	10	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 95 #######################


> Neighbours evaluated; 95
> Selected Move:	9450	3	10	4	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 96 #######################


> Neighbours evaluated; 75
> Selected Move:	9780	3	0	7	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 97 #######################


> Neighbours evaluated; 43
> Selected Move:	9779	4	7	11	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  2  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 98 #######################


> Neighbours evaluated; 65
> Selected Move:	9338	3	18	13	25700


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  2  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 99 #######################


> Neighbours evaluated; 78
> Selected Move:	9334	4	11	7	25700


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 100 #######################


> Neighbours evaluated; 83
> Selected Move:	9450	3	7	0	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 101 #######################


> Neighbours evaluated; 111
> Selected Move:	9515	3	16	10	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 102 #######################


> Neighbours evaluated; 83
> Selected Move:	9570	3	13	5	26500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 103 #######################


> Neighbours evaluated; 71
> Selected Move:	9620	3	11	3	24000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 104 #######################


> Neighbours evaluated; 100
> Selected Move:	9265	3	4	8	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 105 #######################


> Neighbours evaluated; 89
> Selected Move:	9570	3	10	18	24500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 106 #######################


> Neighbours evaluated; 90
> Selected Move:	9440	3	8	11	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 107 #######################


> Neighbours evaluated; 101
> Selected Move:	9488	3	3	15	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 108 #######################


> Neighbours evaluated; 104
> Selected Move:	9460	3	5	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 109 #######################


> Neighbours evaluated; 109
> Selected Move:	9230	3	13	3	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 110 #######################


> Neighbours evaluated; 77
> Selected Move:	9420	3	1	9	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  3  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 
 > pw :0,525

## ITERATION 111 #######################


> Neighbours evaluated; 44
> Selected Move:	9410	3	3	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  3  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,52

## ITERATION 112 #######################


> Neighbours evaluated; 58
> Selected Move:	9392	3	9	5	25900


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 113 #######################


> Neighbours evaluated; 80
> Selected Move:	9271	3	5	6	25600


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 114 #######################


> Neighbours evaluated; 58
> Selected Move:	9450	3	18	16	24600


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,515

## ITERATION 115 #######################


> Neighbours evaluated; 61
> Selected Move:	9570	3	11	5	24100


> New Y[]: 
	
	 2  0  0  0  1  1  3  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 116 #######################


> Neighbours evaluated; 84
> Selected Move:	9570	4	6	5	24400


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 117 #######################


> Neighbours evaluated; 85
> Selected Move:	9520	3	6	19	24400


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 118 #######################


> Neighbours evaluated; 66
> Selected Move:	9520	4	5	19	24100


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 119 #######################


> Neighbours evaluated; 73
> Selected Move:	9450	3	5	11	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,49

## ITERATION 120 #######################


> Neighbours evaluated; 45
> Selected Move:	9450	4	19	11	24000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,485

## ITERATION 121 #######################


> Neighbours evaluated; 57
> Selected Move:	9450	3	15	18	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,48

## ITERATION 122 #######################


> Neighbours evaluated; 33
> Selected Move:	9350	3	11	1	23000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 123 #######################


> Neighbours evaluated; 78
> Selected Move:	9410	3	18	13	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 124 #######################


> Neighbours evaluated; 109
> Selected Move:	9380	3	4	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 125 #######################


> Neighbours evaluated; 102
> Selected Move:	9380	3	13	18	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,46

## ITERATION 126 #######################


> Neighbours evaluated; 76
> Selected Move:	9420	3	19	11	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 127 #######################


> Neighbours evaluated; 83
> Selected Move:	9350	3	11	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,45

## ITERATION 128 #######################


> Neighbours evaluated; 54
> Selected Move:	9350	3	18	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 129 #######################


> Neighbours evaluated; 76
> Selected Move:	9380	3	8	4	23500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 130 #######################


> Neighbours evaluated; 84
> Selected Move:	9280	3	13	11	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 131 #######################


> Neighbours evaluated; 76
> Selected Move:	9450	3	6	10	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 132 #######################


> Neighbours evaluated; 93
> Selected Move:	9450	3	4	13	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 133 #######################


> Neighbours evaluated; 100
> Selected Move:	9433	3	13	6	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 134 #######################


> Neighbours evaluated; 76
> Selected Move:	9380	3	6	5	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 135 #######################


> Neighbours evaluated; 96
> Selected Move:	9360	3	5	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 136 #######################


> Neighbours evaluated; 94
> Selected Move:	9450	3	10	9	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 137 #######################


> Neighbours evaluated; 109
> Selected Move:	9345	3	15	18	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 138 #######################


> Neighbours evaluated; 96
> Selected Move:	9420	3	16	4	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 139 #######################


> Neighbours evaluated; 94
> Selected Move:	9290	3	11	16	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 140 #######################


> Neighbours evaluated; 85
> Selected Move:	9330	3	18	10	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 141 #######################


> Neighbours evaluated; 83
> Selected Move:	9240	3	9	13	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 142 #######################


> Neighbours evaluated; 76
> Selected Move:	9290	3	4	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 143 #######################


> Neighbours evaluated; 72
> Selected Move:	9270	3	13	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 144 #######################


> Neighbours evaluated; 92
> Selected Move:	9230	3	2	4	24000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 145 #######################


> Neighbours evaluated; 97
> Selected Move:	9260	3	10	11	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 146 #######################


> Neighbours evaluated; 104
> Selected Move:	9330	1	-1	15	28500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 147 #######################


> Neighbours evaluated; 111
> Selected Move:	9743	3	5	18	27500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,39

## ITERATION 148 #######################


> Neighbours evaluated; 57
> Selected Move:	9570	3	11	3	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,385

## ITERATION 149 #######################


> Neighbours evaluated; 88
> Selected Move:	9378	3	18	13	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 150 #######################


> Neighbours evaluated; 125
> Selected Move:	9590	3	3	11	28000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 151 #######################


> Neighbours evaluated; 113
> Selected Move:	9450	4	1	13	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 152 #######################


> Neighbours evaluated; 90
> Selected Move:	9450	3	13	10	24400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 153 #######################


> Neighbours evaluated; 78
> Selected Move:	9450	4	10	11	24000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 154 #######################


> Neighbours evaluated; 76
> Selected Move:	9600	3	4	6	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 155 #######################


> Neighbours evaluated; 89
> Selected Move:	9488	3	6	13	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 156 #######################


> Neighbours evaluated; 76
> Selected Move:	9460	3	13	19	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 157 #######################


> Neighbours evaluated; 62
> Selected Move:	9430	3	19	18	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 158 #######################


> Neighbours evaluated; 71
> Selected Move:	9420	3	10	8	24500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,385

## ITERATION 159 #######################


> Neighbours evaluated; 49
> Selected Move:	9550	3	11	6	24600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,38

## ITERATION 160 #######################


> Neighbours evaluated; 46
> Selected Move:	9550	4	6	8	24900


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  3  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 161 #######################


> Neighbours evaluated; 52
> Selected Move:	9543	3	8	4	25100


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,37

## ITERATION 162 #######################


> Neighbours evaluated; 49
> Selected Move:	9493	3	6	19	25100


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  0  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 163 #######################


> Neighbours evaluated; 38
> Selected Move:	9500	3	4	8	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,38

## ITERATION 164 #######################


> Neighbours evaluated; 40
> Selected Move:	9500	4	8	19	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 165 #######################


> Neighbours evaluated; 48
> Selected Move:	9463	3	18	13	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  0  1  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 166 #######################


> Neighbours evaluated; 74
> Selected Move:	9513	3	19	6	25100


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 167 #######################


> Neighbours evaluated; 87
> Selected Move:	9420	3	6	11	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 168 #######################


> Neighbours evaluated; 89
> Selected Move:	9240	3	13	6	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 169 #######################


> Neighbours evaluated; 58
> Selected Move:	9450	3	8	4	24000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 170 #######################


> Neighbours evaluated; 72
> Selected Move:	9555	1	-1	13	29500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 171 #######################


> Neighbours evaluated; 99
> Selected Move:	9533	3	6	19	29500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 172 #######################


> Neighbours evaluated; 73
> Selected Move:	9450	2	14	-1	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 173 #######################


> Neighbours evaluated; 89
> Selected Move:	9453	3	11	14	25200


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  3  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 174 #######################


> Neighbours evaluated; 68
> Selected Move:	9502	3	19	6	25200


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  1  3  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 175 #######################


> Neighbours evaluated; 89
> Selected Move:	9422	4	14	16	25400


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  1  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 176 #######################


> Neighbours evaluated; 88
> Selected Move:	9380	3	16	11	25500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 177 #######################


> Neighbours evaluated; 88
> Selected Move:	9453	3	4	18	26500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 178 #######################


> Neighbours evaluated; 93
> Selected Move:	9520	3	13	5	27000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 179 #######################


> Neighbours evaluated; 90
> Selected Move:	9460	3	6	19	27000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 180 #######################


> Neighbours evaluated; 75
> Selected Move:	9420	3	5	3	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1 
 > pw :0,425

## ITERATION 181 #######################


> Neighbours evaluated; 43
> Selected Move:	9420	3	19	5	25000


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  0  0  0  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 182 #######################


> Neighbours evaluated; 68
> Selected Move:	9637	3	11	6	25100


> New Y[]: 
	
	 2  0  0  1  0  1  3  0  0  0  0  0  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 183 #######################


> Neighbours evaluated; 96
> Selected Move:	9507	3	6	19	25100


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 184 #######################


> Neighbours evaluated; 81
> Selected Move:	9374	4	19	5	25400


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 185 #######################


> Neighbours evaluated; 83
> Selected Move:	9502	3	19	6	25400


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  0  0  0  0  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 186 #######################


> Neighbours evaluated; 96
> Selected Move:	9420	3	5	11	25000


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  0  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 187 #######################


> Neighbours evaluated; 52
> Selected Move:	9265	3	11	13	25100


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  0  0  0  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 188 #######################


> Neighbours evaluated; 101
> Selected Move:	9310	4	13	6	24600


> New Y[]: 
	
	 2  0  0  1  0  0  3  0  0  0  0  0  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 189 #######################


> Neighbours evaluated; 107
> Selected Move:	9330	3	3	16	24600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  0  0  0  1  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 190 #######################


> Neighbours evaluated; 94
> Selected Move:	9283	4	6	13	25100


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  0  0  3  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 191 #######################


> Neighbours evaluated; 92
> Selected Move:	9420	3	13	9	24500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  3  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 192 #######################


> Neighbours evaluated; 78
> Selected Move:	9330	3	18	11	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  3  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 193 #######################


> Neighbours evaluated; 84
> Selected Move:	9325	3	6	19	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  1  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,49

## ITERATION 194 #######################


> Neighbours evaluated; 60
> Selected Move:	9300	3	19	10	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  1  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 195 #######################


> Neighbours evaluated; 72
> Selected Move:	9168	3	9	6	26600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  1  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 196 #######################


> Neighbours evaluated; 73
> Selected Move:	9430	3	10	5	26600


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 197 #######################


> Neighbours evaluated; 83
> Selected Move:	9270	4	6	5	26900


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 198 #######################


> Neighbours evaluated; 88
> Selected Move:	9260	3	6	4	24900


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,515

## ITERATION 199 #######################


> Neighbours evaluated; 82
> Selected Move:	9260	4	5	11	24000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,52

## ITERATION 200 #######################


> Neighbours evaluated; 86
> Selected Move:	9140	3	4	10	26000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,525

## ITERATION 201 #######################


> Neighbours evaluated; 78
> Selected Move:	9158	3	5	8	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  1  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,53

## ITERATION 202 #######################


> Neighbours evaluated; 58
> Selected Move:	9155	3	10	19	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,535

## ITERATION 203 #######################


> Neighbours evaluated; 38
> Selected Move:	9179	3	11	13	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  0  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,54

## ITERATION 204 #######################


> Neighbours evaluated; 58
> Selected Move:	9284	4	13	8	25400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  0  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,545

## ITERATION 205 #######################


> Neighbours evaluated; 64
> Selected Move:	9332	3	19	6	25400


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  3  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,55

## ITERATION 206 #######################


> Neighbours evaluated; 75
> Selected Move:	9250	3	8	4	25600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,555

## ITERATION 207 #######################


> Neighbours evaluated; 69
> Selected Move:	9197	3	6	19	25600


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  0  0  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,56

## ITERATION 208 #######################


> Neighbours evaluated; 53
> Selected Move:	9306	4	4	16	25400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  1  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,565

## ITERATION 209 #######################


> Neighbours evaluated; 69
> Selected Move:	9247	3	16	11	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 210 #######################


> Neighbours evaluated; 67
> Selected Move:	9165	3	15	16	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,575

## ITERATION 211 #######################


> Neighbours evaluated; 76
> Selected Move:	9162	3	19	6	25500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 212 #######################


> Neighbours evaluated; 86
> Selected Move:	9260	3	14	15	25500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,585

## ITERATION 213 #######################


> Neighbours evaluated; 91
> Selected Move:	8906	4	11	6	26100


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,59

## ITERATION 214 #######################


> Neighbours evaluated; 80
> Selected Move:	9336	3	13	18	25600


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,595

## ITERATION 215 #######################


> Neighbours evaluated; 64
> Selected Move:	9331	3	6	14	25200


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,6

## ITERATION 216 #######################


> Neighbours evaluated; 38
> Selected Move:	9260	3	14	19	25600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,605
________________________________________________________________

Best solution found: 10230
Run Termination time: 31.01.2010 12:03:36
Run duration: 00:05:56.1562500
________________________________________________________________
